Breaking Out CSPs
نویسنده
چکیده
In this paper, we present the very efficient and unparametrized local search algorithm called Weighted Min-Conflicts (WMC), based on Morris’ Breakout Method, and show how the relationship existing between WMC and the dom/wdeg heuristic used with MGAC can be used to design a simple hybrid algorithm. An exhaustive experimentation will be performed, considering in particular the instances used as benchmarks during the second competition of CSP solvers. The results show how WMC and hybrid algorithms outperforms standard Min-Conflicts, Tabu search and MGAC-dom/wdeg on various sets of random and structured instances.
منابع مشابه
Arities of Symmetry Breaking Constraints
Static symmetry breaking is a well-established technique to speed up the solving process of symmetric Constraint Satisfaction Programs (csps). Static symmetry breaking suffers from two inherent problems: symmetry breaking constraints come in great numbers and are of high arity. Here, we consider the problem of high arity. We prove that not even for binary csps can we always reduce the arity of ...
متن کاملTractable Symmetry Breaking for CSPs with Interchangeable Values
Symmetry breaking in CSPs has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries during search. In general, these schemes may take exponential space or time to eliminate all symmetries. This paper studies classes of CSPs for which symmetry breaking is tractable. It identifies several CSP classes which feature various forms of val...
متن کاملNew Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, in the form of computational group theory. GE-trees are a new conceptual abstraction, providing low-degree polynomial time methods for breaking value symmetries in CSPs. In this paper we analyse the structure of symmet...
متن کاملStructural Symmetry Breaking
Symmetry breaking has been shown to be an important method to speed up the search in constraint satisfaction problems that contain symmetry. When breaking symmetry by dominance detection, a computationally efficient symmetry breaking scheme can be achieved if we can solve the dominance detection problem in polynomial time. We study the complexity of dominance detection when value and variable s...
متن کاملStructural Symmetry Breaking for Constraint Satisfaction Problems
In recent years, symmetry breaking for constraint satisfaction problems (CSPs) has attracted considerable attention. Various general schemes have been proposed to eliminate symmetries. In general, these schemes may take exponential space or time to eliminate all the symmetries. We identify several classes of CSPs that encompass many practical problems and for which symmetry breaking for various...
متن کاملSymmetry Breaking with Polynomial Delay
A conservative class of constraint satisfaction problems (csps) is a class for which membership is preserved under arbitrary domain reductions. Many well-known tractable classes of csps are conservative. It is well known that lexleader constraints may significantly reduce the number of solutions by excluding symmetric solutions of csps. We show that adding certain lexleader constraints to any i...
متن کامل